-
1 program complexity metric
Большой англо-русский и русско-английский словарь > program complexity metric
-
2 program complexity metric
English-Russian dictionary of computer science and programming > program complexity metric
-
3 metric
1) мера, показатель, мн. система показателей, метрика- software metrics2) размер (ширина и высота отображаемого элемента, напр., курсора)- lines-of-code metric
- line-spacing metricEnglish-Russian dictionary of computer science and programming > metric
-
4 показатель сложности программы
Большой англо-русский и русско-английский словарь > показатель сложности программы
-
5 показатель сложности программы
Русско-английский словарь по вычислительной технике и программированию > показатель сложности программы
См. также в других словарях:
Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program … Wikipedia
Programming Complexity — Programming Complexity, which is often also referred to as Software Complexity is a term that encompasses numerous properties of a piece of software, all of which affect internal interactions. According to several commentators, including… … Wikipedia
Halstead complexity measures — are software metrics indroduced by Maurice Howard Halstead in 1977. These metrics are computed statically, without program execution. Calculation First we need to compute the following numbers, given the program: * n1 = the number of distinct… … Wikipedia
Software metric — A software metric is a measure of some property of a piece of software or its specifications.Since quantitative methods have proved so powerful in the other sciences, computer science practitioners and theoreticians have worked hard to bring… … Wikipedia
Decomposition (computer science) — Decomposition in computer science, also known as factoring, refers to the process by which a complex problem or system is broken down into parts that are easier to conceive, understand, program, and maintain. Contents 1 Overview 2 Decomposition… … Wikipedia
Цикломатическая сложность — программы (англ. Cyclomatic complexity of a program) структурная (или топологическая) мера сложности программ, используемая для измерения качества программного обеспечения, основанная на методах статического анализа кода. ЦСП равна… … Википедия
Decomposition paradigm — A decomposition paradigm in computer programming is a strategy for organizing a program as a number of parts, and it usually implies a specific way to organize a program text.Usually the aim of using a decomposition paradigm is to optimize some… … Wikipedia
Business and Industry Review — ▪ 1999 Introduction Overview Annual Average Rates of Growth of Manufacturing Output, 1980 97, Table Pattern of Output, 1994 97, Table Index Numbers of Production, Employment, and Productivity in Manufacturing Industries, Table (For Annual… … Universalium
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… … Wikipedia
Endgame tablebase — A typical interface for querying a tablebase An endgame tablebase is a computerized database that co … Wikipedia